#define _CRT_SECURE_NO_WARNINGS 1

#include"Sort.h"

void test_ShellSort()
{
	int a[] = { 10,9,8,7,5,6,4,3,2,1 };
	size_t size = sizeof(a) / sizeof(a[0]);
	PrintArray(a, size);
	ShellSort(a, size);
	PrintArray(a, size);
}

void test_MergeSort()
{
	int a[] = { 10,9,8,7,5,6,4,3,2,1 };
	size_t size = sizeof(a) / sizeof(a[0]);
	PrintArray(a, size);
	MergeSort(a, size);
	PrintArray(a, size);
}

void test_SelectSort()
{
	int a[] = { 10,9,8,7,5,6,4,3,2,1 };
	size_t size = sizeof(a) / sizeof(a[0]);
	PrintArray(a, size);
	SelectSort(a, size);
	PrintArray(a, size);
}

void test_InsertSort()
{
	int a[] = { 10,9,8,7,5,6,4,3,2,1 };
	size_t size = sizeof(a) / sizeof(a[0]);
	PrintArray(a, size);
	InsertSort(a, size);
	PrintArray(a, size);
}

void test_BubbleSort()
{
	int a[] = { 10,9,8,7,5,6,4,3,2,1 };
	size_t size = sizeof(a) / sizeof(a[0]);
	PrintArray(a,size);
	BubbleSort(a, size);
	PrintArray(a,size);
}

void test_QuickSort()
{
	int a[] = { 10,9,8,7,5,6,3,4,2,1 };
	size_t size = sizeof(a) / sizeof(a[0]);
	PrintArray(a, size);
	QuickSort(a, 0,size - 1);
	PrintArray(a, size);
}

void test_MergeSortNonR()
{
	int a[] = { 10,9,8,7,5,6,3,4,2,1 };
	size_t size = sizeof(a) / sizeof(a[0]);
	PrintArray(a, size);
	MergeSortNonR(a, size);
	PrintArray(a, size);
}

int main()
{
	 test_MergeSortNonR();

	return 0;
}